Construction results for MDS-convolutional codes - International Symposium on Information Theory, 2000. Proceedings. IEEE

Constructions of MDS-convolutional codes

Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...

Convolutional Code Constructions Resulting in Maximal or near Maximal Free Distance - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

In this paper we discuss an upper bound on the free distance for a rate k / n convolutional code with complexity b . Using th i s bound we in t roduce the notion of a MDS convolutional code. We also give an algebraic way of cons t ruc t ing b inary codes of rate 1/2 and large complexity. The obta ined distances compare favorably to the distances found by computer searches and probabilistic meth...

The Trellis Complexity of Convolutional Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Constructions of MDS-convolutional codes - Information Theory, IEEE Transactions on

Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate and each degree . The c...

On MDS codes via Cauchy matrices

The special form of Cauchy matrices is used to obtain a tighter bound for the validity region of the MDS Conjecture and a new compact characterization of generalized Reed-Solomon codes. The latter is further used to obtain constructions and some nonexistence results of long [2k, k] double-circulant MDS codes. This work was presented in part at the IEEE International Symposium on Information The...